/*
    <one line to give the program's name and a brief idea of what it does.>
    Copyright (C) <year>  <name of author>

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.

*/

#include "state.h"
#include <map>
#include <algorithm>

using namespace std;

State * State::next() {
    vector<State *>::iterator it = max_element(_nexts.begin(), _nexts.end());
    if (it != _nexts.end())
        return *it;
    else
        return find_state(next_id());
}

State * State::prev() {
    vector<State *>::iterator it = max_element(_prevs.begin(), _prevs.end());
    if (it != _prevs.end())
        return *it;
    else
        return find_state(next_id());
}

State::State(unsigned long id) {
    _id = id;
    _nice = 50;
    _nexts.clear();
    _prevs.clear();
}

